RAIDq: A Software-friendly, Multiple-parity RAID
نویسندگان
چکیده
As disk manufacturers compete to build ever larger and cheaper disks, the possibility of RAID failures becomes more significant for larger and larger disk arrays, creating opportunities for products beyond RAID 6. In this paper, we present the design and implementation of RAIDq, a software-friendly, multiple-parity RAID. RAIDq uses a linear code with efficient encoding and decoding algorithms and addresses a wide range of general cases of RAID that are of practical interest. However, RAIDq does have a limit on how many data disks it can support, which we will analyze in this paper. A second benefit of RAIDq is that it includes existing RAID 5 and 6 as special cases and hence is 100% backward compatible. This allows RAIDq to reuse the efficient coding algorithms and implementations of RAID 5 and 6. Last but not least, RAIDq is optimized for software implementation, as its encoding only involves simple XOR and multiplication by several fixed elements in a finite field. Thanks to the popularity of RAID 6, such operations have been highly optimized on modern processors, of which RAIDq can take advantage, as corroborated by our experiment results.
منابع مشابه
ARC: An Approach to Flexible and Robust RAID Systems
RAID systems increase data storage reliability by employing one or more data integrity techniques such as parity or checksum. However, the current implementations of software RAID systems suffer both inflexibility and unrobustness. First, different software RAID levels require different RAID systems and the system written for one level cannot be reused for others. In addition, writing a new RAI...
متن کاملMulti-Terabyte EIDE Disk Arrays running Linux RAID5
High-energy physics experiments are currently recording large amounts of data and in a few years will be recording prodigious quantities of data. New methods must be developed to handle this data and make analysis at universities possible. Grid Computing is one method; however, the data must be cached at the various Grid nodes. We examine some storage techniques that exploit recent developments...
متن کاملRow-Diagonal Parity for Double Disk Failure Correction (Awarded Best Paper!)
Row-Diagonal Parity (RDP) is a new algorithm for protecting against double disk failures. It stores all data unencoded, and uses only exclusive-or operations to compute parity. RDP is provably optimal in computational complexity, both during construction and reconstruction. Like other algorithms, it is optimal in the amount of redundant information stored and accessed. RDP works within a single...
متن کامل1 9 N ov 2 00 4 Multi - Terabyte EIDE Disk Arrays running Linux RAID 5
High-energy physics experiments are currently recording large amounts of data and in a few years will be recording prodigious quantities of data. New methods must be developed to handle this data and make analysis at universities possible. Grid Computing is one method; however, the data must be cached at the various Grid nodes. We examine some storage techniques that exploit recent developments...
متن کاملPerformance of Recovery Time Improvement Algorithms for Software RAIDs
A software RAID is a RAID implemented purely in software running on a host computer. One problem with software RAIDS is that they do not have access to special hardware such as NVRAM. Thus, software RAIDs may need to check every parity group of an array for consistency following a host crash or power failure. This process of checking parity groups is called recovery, and results in long delays ...
متن کامل